Any-world assumptions in logic programming

نویسندگان

  • Yann Loyer
  • Umberto Straccia
چکیده

Due to the usual incompleteness of information representation, any approach to assign a semantics to logic programs has to rely on a default assumption on the missing information. The stable model semantics, that has become the dominating approach to give semantics to logic programs, relies on the Closed World Assumption (CWA), which asserts that by default the truth of an atom is false. There is a second well-known assumption, called Open World Assumption (OWA), which asserts that the truth of the atoms is supposed to be unknown by default. However, the CWA, the OWA and the combination of them are extremal, though important, assumptions over a large variety of possible assumptions on the truth of the atoms, whenever the truth is taken from an arbitrary truth space. The topic of this paper is to allow any assignment (i.e. interpretation), over a truth space, to be a default assumption. Our main result is that our extension is conservative in the sense that under the “everywhere false” default assumption (CWA) the usual stable model semantics is captured. Due to the generality and the purely algebraic nature of our approach, it abstracts from the particular formalism of choice and the results may be applied in other contexts as well.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Default Knowledge in Logic Programs with Uncertainty

Many frameworks have been proposed to manage uncertain information in logic programming. Essentially, they differ in the underlying notion of uncertainty and how these uncertainty values, associated to rules and facts, are managed. The goal of this paper is to allow the reasoning with non-uniform default assumptions, i.e. with any arbitrary assignment of default values to the atoms. Informally,...

متن کامل

Goal Programming Approach to the Bi-Objective Competitive Flow-Capturing Location-Allocation Problem

  Majority of models in location literature are based on assumptions such as point demand, absence of competitors, as well as monopoly in location, products, and services. However in real-world applications, these assumptions are not well-matched with reality. In this study, a new mixed integer nonlinear programming model based on weighted goal programming approach is proposed to maximize the c...

متن کامل

An Assumption-Based Framework for Non-Monotonic Reasoning

The notion of assumption-based framework generalises and reenes the use of abduction to give a formalisation of non-monotonic reasoning. In this framework, a sentence is a non-monotonic consequence of a theory if it can be derived monotonically from a theory extended by means of acceptable assumptions. The notion of acceptability for such assumptions is formulated in terms of their ability succ...

متن کامل

Combining Fixed-Point Definitions and Game Semantics in Logic Programming

Logic programming with fixed-point definitions is a useful extension of traditional logic programming. Fixed-point definitions can capture simple model checking problems and closed-world assumptions. Its operational semantics is typically based on intuitionistic provability. We extend the operational semantics of these languages with game semantics. This extended semantics has several interesti...

متن کامل

Satisfiability for First-order Logic as a Non-Modal Deontic Logic

In modal deontic logics, the focus is on inferring logical consequences, for example inferring whether or not an obligation O mail, to mail a letter, logically implies O [mail  burn] ,an obligation to mail or burn the letter. Here I present an alternative approach in which obligations are sentences (such as mail) in first-order logic (FOL), and the focus is on satisfying those sentences by mak...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 342  شماره 

صفحات  -

تاریخ انتشار 2005